منابع مشابه
Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming Ratio C = 6
SONET/WDM networks using wavelength add-drop multiplexing can be constructed using certain graph decompositions used to form a grooming, consisting of unions of primitive rings. The cost of such a decomposition is the sum, over all graphs in the decomposition, of the number of vertices of nonzero degree in the graph. The existence of such decompositions with minimum cost, when every pair of sit...
متن کاملTraffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming Ratio
SONET/WDM networks using wavelength add-drop multiplexing can be constructed using certain graph decompositions used to form a grooming, consisting of unions of primitive rings. The cost of such a decomposition is the sum, over all graphs in the decomposition, of the number of vertices of nonzero degree in the graph. The existence of such decompositions with minimum cost, when every pair of sit...
متن کاملOn Ring Grooming in optical networks
An instance I of Ring Grooming consists of m sets A1, A2, . . . , Am from the universe {0, 1, . . . , n − 1} and an integer g ≥ 2. The unrestricted variant of Ring Grooming, referred to as Unrestricted Ring Grooming, seeks a partition {P1, P2, . . . , Pk} of {1, 2, . . . , m} such that |Pi | ≤ g for each 1 ≤ i ≤ k and ∑k i=1 | ⋃ r∈Pi Ar | is minimized. The restricted variant of Ring Grooming, r...
متن کاملSurvivable Traffic Grooming in WDM Optical Networks
Traffic grooming, in which low-rate circuits are multiplexed onto wavelengths, with the goal of minimizing the number of add-drop multiplexers (ADMs) and wavelengths has received much research attention from the optical networking community in recent years. While previous work has considered various traffic models and network architectures, protection requirements of the circuits have not been ...
متن کاملGrooming for two-period optical networks
Minimizing the number of add-drop multiplexers (ADMs) in a unidirectional SONET ring can be formulated as a graph decomposition problem. When traffic requirements are uniform and all-to-all, groomings that minimize the number of ADMs (equivalently, the drop cost) have been characterized for grooming ratio at most six. However, when two different traffic requirements are supported, these solutio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2011
ISSN: 0012-365X
DOI: 10.1016/j.disc.2010.09.013